Generalized Fractional Algebraic Linear System Solvers
نویسندگان
چکیده
This paper is devoted to the numerical computation of algebraic linear systems involving several matrix power functions; that finding x solution $$\sum _{\alpha \in \mathbb {R}}A^{\alpha }x=b$$ . These will be referred as Generalized Fractional Algebraic Linear Systems (GFALS). In this paper, we derive gradient methods for solving these very computationally complex problems, which themselves require intermiediate standard (FALS) $$A^{\alpha , with $$\alpha {R_+}$$ The latter usually many classical $$Ax=b$$ We also show in some cases, a GFALS problem can obtained first-order hyperbolic system conservation laws. discuss connections between PDE-approach and gradient-type methods. convergence analysis addressed experiments are proposed illustrate compare paper.
منابع مشابه
Hybrid Parallel Linear System Solvers
This paper presents a new approach to the solution of nonsymmetric linear systems that uses hybrid techniques based on both direct and iterative methods An implicitly preconditioned modi ed system is obtained by applying projections onto block rows of the original system Our technique provides the exibility of using either direct or iter ative methods for the solution of the preconditioned syst...
متن کاملLinear System Solvers : Sparse Iterative
In this chapter we will present an overview of a number of related iterative methods for the solution of linear systems of equations. These methods are so-called Krylov projection type methods and they include popular methods as Conjugate Gradients, Bi-Conjugate Gradients, LSQR and GMRES. We will sketch how these methods can be derived from simple basic iteration formulas, and how they are inte...
متن کاملGeneralized linear fractional programming under interval uncertainty
Data in many real-life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb. We consider a generalized linear fractional programming problem with interval data and present an efficient method for computing the range of optimal values. The method reduces the problem to solving...
متن کاملDuality in generalized linear fractional programming
This is a generalization of a fractional programming problem (p = 1) which has been investigated quite actively in the last two decades [21 ]. In [20] many of the results in fractional programming are reviewed and extended. An extensive bibliography is given in [22]. An early application of generalized fractional programming (p > 1) is von Neumann's model of an expanding economy [25]. Here the ...
متن کاملMultilevel Algebraic Elliptic Solvers
We survey some of the recent research in developing multilevel algebraic solvers for elliptic problems. A key concept is the design of a hierarchy of coarse spaces and related interpolation operators which together satisfy certain approximation and stability properties to ensure the rapid convergence of the resulting multigrid algorithms. We will discuss smoothed agglomeration methods, harmonic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2022
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-022-01785-z